On upper bounding Shannon capacity of graph through generalized conic programming
نویسندگان
چکیده
منابع مشابه
On the Shannon capacity of a graph
A/Mmcr-It is proved that the Shannon zero-error capacity of the pentagon is e. The method is then generalized to obtain upper bounds on the capacity of au arbitrary graph. A well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases. Several results are obtained on the capacity of special g...
متن کاملThe Shannon Capacity of a Graph
This thesis focuses on the Shannon capacity of a graph. Suppose we want to send a message across a channel to a receiver. The general question is about the effective size of an alphabet in a model such that the receiver may recover the original message without errors. To answer this question Shannon defined the Shannon capacity of a graph, Θ(G), and stated Shannon’s Theorem. We study an article...
متن کاملUpper-Bounding the Capacity of Relay Communications - Part II
This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the mathematical model of different relaying strategies including cutset and amplify and forward strategies. The cutset upper bound capacity is presented as a referen...
متن کاملUpper-Bounding the Capacity of Relay Communications - Part I
This paper focuses on the capacity of point-to-point relay communications wherein the transmitter is assisted by an intermediate relay. We detail the mathematical model of cutset and amplify and forward (AF) relaying strategy. We present the upper bound capacity of each relaying strategy from information theory viewpoint and also in networks with Gaussian channels. We exemplify various outer re...
متن کاملA Conic Programming Approach to Generalized Tchebycheff Inequalities
Consider the problem of finding optimal bounds on the expected value of piece-wise polynomials over all measures with a given set of moments. This is a special class ofGeneralized Tchebycheff Inequalities in probability theory. We study this problem within the framework of conic programming. Relying on a general approximation scheme for conic programming, we show that these bounds can be numeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2019
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-019-01436-7